Computation of Best One - Sided Lx Approximation
نویسنده
چکیده
A computational procedure based on linear programming is presented for finding the best one-sided Li approximation to a given function. A theorem which ensures that the computational procedure yields approximations which converge to the best approximation is proved. Some numerical examples are discussed.
منابع مشابه
Best one-sided L1 approximation to the Heaviside and sign functions
We find the polynomials of the best one-sided approximation to the Heaviside and sign functions. The polynomials are obtained by Hermite interpolation at the zeros of some Jacobi polynomials. Also we give an estimate of the error of approximation and characterize the extremal points of the convex set of the best approximants. c ⃝ 2012 Elsevier Inc. All rights reserved.
متن کاملFinite element approximation of one-sided Stefan problems with anisotropic, approximately crystalline, Gibbs-Thomson law
We present a finite element approximation for the one-sided Stefan problem and the one-sided Mullins–Sekerka problem, respectively. The problems feature a fully anisotropic Gibbs–Thomson law, as well as kinetic undercooling. Our approximation, which couples a parametric approximation of the moving boundary with a finite element approximation of the bulk quantities, can be shown to satisfy a sta...
متن کاملBest one-sided approximation of polynomials under L1 norm
In this paper, we develop an analytic solution for the best one-sided approximation of polynomials under L1 norm, that is, we 0nd two polynomials with lower degree which bound the given polynomial such that the areas between the bounding polynomials and the given polynomial attain minimum. The key ingredient of our technique is a characterization for one-sided approximations based on orthogonal...
متن کاملTwo-sided approximation for some Newton's type methods
We suggest and analyze a combination of a damped Newton’s method and a simplified version of Newton’s one. We show that the proposed iterations give two-sided approximations of the solution which can be efficiently used as posterior estimations. Some numerical examples illustrate the efficiency and performance of the method proposed. 2014 Published by Elsevier Inc.
متن کاملParallel Svd Computation in Updating Problems of Latent Semantic Indexing ∗
In latent semantic indexing, the addition of documents (or the addition of terms) to some already processed text collection leads to the updating of the best rank-k approximation of the term-document matrix. The computationally most intensive task in this updating is the computation of the singular value decomposition (SVD) of certain square matrix, which is upper or lower triangular, and conta...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010